Convex Combinations of Minimal Graphs

نویسندگان

  • Michael John Dorff
  • Ryan Viertel
  • Magdalena Woloszkiewicz
چکیده

Given a collection of minimal graphs,M1,M2, . . . ,Mn, with isothermal parametrizations in terms of the Gauss map and height differential, we give sufficient conditions onM1,M2, . . . ,Mn so that a convex combination of themwill be a minimal graph. We will then provide two examples, taking a convex combination of Scherk’s doubly periodic surface with the catenoid and Enneper’s surface, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex combinations of harmonic shears of slit mappings

‎In this paper‎, ‎we study the convex combinations of harmonic mappings obtained by shearing a class of slit conformal mappings‎. ‎Sufficient conditions for the convex combinations of harmonic mappings of this family to be univalent and convex in the horizontal direction are derived‎. ‎Several examples of univalent harmonic mappings constructed by using these methods are presented to illustrate...

متن کامل

Optimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means

We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)

متن کامل

Minimal Graphs in R over Convex Domains

Krust established that all conjugate and associate surfaces of a minimal graph over a convex domain are also graphs. Using a convolution theorem from the theory of harmonic univalent mappings, we generalize Krust’s theorem to include the family of convolution surfaces which are generated by taking the Hadamard product or convolution of mappings. Since this convolution involves convex univalent ...

متن کامل

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

Cohen-Macaulay $r$-partite graphs with minimal clique cover

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012